// #include "Graph/Gragh.hpp"
// #include "Sort/BubbleSort.hpp"
// #include "Sort/HeapSort.hpp"
// #include "Sort/InsertionSort.hpp"
// #include "Sort/MergeSort.hpp"
// #include "Sort/QuickSort.hpp"
// #include "Sort/SelectionSort.hpp"
// #include "Tree/Tree.hpp"
// #include "ProblemList/Array/MedianofTwoSortedArrays.hpp"
// #include "ProblemList/Array/LongestConsecutiveSequence.hpp"
// #include "ProblemList/Array/LinkedList/ReverseLinkedListII.hpp"
// #include "ProblemList/Array/LinkedList/PartitionList.hpp"
// #include "ProblemList/String/StringToInteger(atoi).hpp"
// #include "ProblemList/Stack/LongestValidParentheses.hpp"
// #include "ProblemList/Sort/MergeSortedArray.hpp"
// #include "ProblemList/Sort/MergekSortedLists.hpp"
// #include"ProblemList/Search/SearchInsertPosition.hpp"
// #include "ProblemList/Search/SearchA2DMatrix.hpp"
// #include "ProblemList/Enumeration/Subsets.hpp"
// #include "ProblemList/Enumeration/Permutations.hpp"
// #include "ProblemList/BreadFirstSearch/WordLadder.hpp"
#include "ProblemList/DepthFirstSearch/PalindromePartitioning.hpp"
int main(int argc, char* argv[])
{
    // SelectionSort::Demo();
    // BubbleSort::Demo();
    // InsertionSort::Demo();
    // QuickSort::Demo();
    //MergeSort::Demo();
    /*HeapSort::Demo();*/
    // Tree::Demo();
    // GraphSpace::GraphDemo::Demo();
    // Solution::demo();
    Solution::Demo();
    return 1;
    return 0;
}
